Disjunctive closures for knowledge compilation
نویسندگان
چکیده
منابع مشابه
Disjunctive closures for knowledge compilation
The knowledge compilation (KC) map [1] can be viewed as a multi-criteria evalu-ation of a number of target classes of representations for propositional KC. Usingthis map, the choice of a class for a given application can be made, consideringboth the space efficiency of it (i.e., its ability to represent information using lit-tle space), and its time efficiency, i.e., the queries...
متن کاملExistential Closures for Knowledge Compilation
We study the existential closures of several propositional languages L considered recently as target languages for knowledge compilation (KC), namely the incomplete fragments KROM-C, HORN-C, K/H-C, renH-C, AFF, and the corresponding disjunction closures KROM-C[∨], HORN-C[∨], K/H-C[∨], renH-C[∨], and AFF[∨]. We analyze the queries, transformations, expressiveness and succinctness of the resultin...
متن کاملCompilation for Critically onstrained Knowledge
We show that many “critically constrained” Random 3SAT knowledge bases (KBs) can be compiled into disjunctive normal form easily by using a variant of the “Davis-Putnam” proof procedure. From these compiled KBs we can answer all queries about entailment of conjunctive normal formulas, also easily compared to a “bruteforce” approach to approximate knowledge compilation into unit clauses for the ...
متن کاملKnowledge Compilation for Itemset Mining
Mining frequently occurring patterns or itemsets is a fundamental task in datamining. Many ad-hoc itemset mining algorithms have been proposed for enumerating frequent, maximal and closed itemsets. The datamining community has been particularly interested in finding itemsets that satisfy additional constraints, which is a challenging task for existing techniques. In this paper we present a nove...
متن کاملNormal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function. Reduction strategies are developed that provide a unique reduced factored negation normal form. These com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2014
ISSN: 0004-3702
DOI: 10.1016/j.artint.2014.07.004